Stochastic Complementarity
نویسندگان
چکیده
منابع مشابه
Stochastic R0 Matrix Linear Complementarity
We consider the expected residual minimization formulation of the stochastic R0 matrix linear complementarity problem. We show that the involved matrix being a stochastic R0 matrix is a necessary and sufficient condition for the solution set of the expected residual minimization problem to be nonempty and bounded. Moreover, local and global error bounds are given for the stochastic R0 matrix li...
متن کاملNew reformulations for stochastic nonlinear complementarity problems
We consider the stochastic nonlinear complementarity problem (SNCP). We first formulate the problem as a stochastic mathematical program with equilibrium constraints and then, in order to develop efficient algorithms, we give some reformulations of the problem. Furthermore, based on the reformulations, we propose a smoothed penalty method for solving SNCP. A rigorous convergence analysis is als...
متن کاملSimple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems
We show that the problem of finding optimal strategies for both players in a simple stochastic game reduces to the generalized linear complementarity problem (GLCP) with a P-matrix, a well-studied problem whose hardness would imply NP = co-NP. This makes the rich GLCP theory and numerous existing algorithms available for simple stochastic games. As a special case, we get a reduction from binary...
متن کاملA complementarity model for solving stochastic natural gas market equilibria
This paper presents a stochastic equilibrium model for deregulated natural gas markets. Each market participant (pipeline operators, producers, etc.) solves a stochastic optimization problem whose optimality conditions, when combined with market-clearing conditions give rise to a certain mixed complementarity problem (MiCP). The stochastic aspects are depicted by a recourse problem for each pla...
متن کاملLinear Complementarity and P-Matrices for Stochastic Games
We define the first nontrivial polynomially recognizable subclass of P-matrixGeneralized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No such classes/rules were previously known. We show that a subclass of Shapley turn-based stochastic games, subsuming Condon’s simple stochastic games, is reducible to the new class of GLCPs. Based on this we suggest the new strongly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Economic Journal
سال: 2018
ISSN: 0013-0133,1468-0297
DOI: 10.1111/ecoj.12601